Marginal parameterizations of discrete models defined by a set of conditional independencies
نویسندگان
چکیده
It is well-known that a conditional independence statement for discrete variables is equivalent to constraining to zero a suitable set of log–linear interactions. In this paper we show that this is also equivalent to zero constraints on suitable sets of marginal log–linear interactions, that can be formulated within a class of smooth marginal log–linear models. This result allows much more flexibility than known until now in combining several conditional independencies into a smooth marginal model. This result is the basis for a procedure that can search for such a marginal parameterization, so that, if one exists, the model is smooth. © 2010 Elsevier Inc. All rights reserved.
منابع مشابه
Learning from Pairwise Marginal Independencies
We consider graphs that represent pairwise marginal independencies amongst a set of variables (for instance, the zero entries of a covariance matrix for normal data). We characterize the directed acyclic graphs (DAGs) that faithfully explain a given set of independencies, and derive algorithms to efficiently enumerate such structures. Our results map out the space of faithful causal models for ...
متن کاملDecomposable Log-linear Models Decomposable Log-linear Models
The present paper considers discrete probability models with exact computational properties. In relation to contingency tables this means closed form expressions of the maksimum likelihood estimate and its distribution. The model class includes what is known as decomposable graphical models, which can be characterized by a structured set of conditional independencies between some variables give...
متن کاملOn Marginal Automorphisms of a Group Fixing the Certain Subgroup
Let W be a variety of groups defined by a set W of laws and G be a finite p-group in W. The automorphism α of a group G is said to bea marginal automorphism (with respect to W), if for all x ∈ G, x−1α(x) ∈ W∗(G), where W∗(G) is the marginal subgroup of G. Let M,N be two normalsubgroups of G. By AutM(G), we mean the subgroup of Aut(G) consistingof all automorphisms which centralize G/M. AutN(G) ...
متن کاملCausal Inference on Data Containing Deterministic Relations
Data containing deterministic relations cannot be handled by current constraint-based causal learning algorithms; they entail conditional independencies that cannot be represented by a faithful graph. Violation of the faithfulness property is characterized by an information equivalence of two sets of variables with respect to a reference variable. The conditional independencies do not provide i...
متن کاملمقایسه مدلهای لجستیک حاشیهای با اندازهگیری مکرر و لجستیک شرطی در بررسی عوامل موثر بر پرفشاری خون
Background and purpose: To analyze the data in which the correlation between observations are to be considered, a general method is using marginal model with repeated measures, yet there is another method called conditional model with random clusters. Âccording to the binary responses, the aim of the present study is to compare the efficiency of these two models in studying the risk factors a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Multivariate Analysis
دوره 101 شماره
صفحات -
تاریخ انتشار 2010